Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets

This paper describes a distributed algorithm (generalized d-CDS) for producing a variety of d-dominating sets of nodes that can be used to form the backbone of an ad hoc wireless network. In special cases (ordinary d-CDS), these sets are also d-hop connected and has a desirable “shortest path property”. Routing via the backbone created is also discussed. The algorithm has a “constant-time” comp...

متن کامل

A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks

In this paper, we propose an adaptive selfstabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with communication requests between the nodes in the network. The set changes as the network topology changes. It contains redundancy nodes and can be used as a backbone of an ad hoc mobile network.

متن کامل

Routing Algorithms for Mobile Multi-Hop Ad-Hoc Networks

A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These networks have an important advantage, they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. This flexibility, however, comes at a price: communication is difficult to organize due to frequent to...

متن کامل

Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets

1 Motivation An ad-hoc network is a multihop wireless network in which mobile hosts communicate over a shared, scarce wireless channel. An ad-hoc network is characterized by the absence of a wired backbone or any sort of centralized network management system to maintain routes as hosts move or turn oo or on. Since routes change quickly not only because end nodes move but also because intermedia...

متن کامل

A Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks

Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Networks

سال: 2005

ISSN: 1389-1286

DOI: 10.1016/j.comnet.2004.09.005